Terminal coalgebras in well-founded set theory
نویسندگان
چکیده
منابع مشابه
Additions and Corrections to "Terminal Coalgebras in Well-founded Set Theory"
Barr, M., Additions and corrections to “Terminal coalgebras in well-founded set theory”, Theoretical Computer Science 124 (1994) 1899192. This note is to correct certain mistaken impressions of the author’s that were in the original paper, “Terminal coalgebras in well-founded set theory”, which appeared in Theoretical Computer Science 114 (1993) 299-315. While writing the original paper, I was ...
متن کاملWell-founded coalgebras, revisited
Theoretical models of recursion schemes have been well studied under the names well-founded coalgebras, recursive coalgebras, corecursive algebras, and Elgot algebras. Much of this work focuses on conditions ensuring unique or canonical solutions, e.g. when the coalgebra is well-founded. If the coalgebra is not well-founded, then there can be multiple solutions. The standard semantics of recurs...
متن کاملOn Modal μ-Calculus and Non-Well-Founded Set Theory
A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new i...
متن کاملModal Logic and Non-well-founded Set Theory: Translation, Bisimulation, Interpolation. Illc Dissertation Series 1998-4 Modal Logic and Non-well-founded Set Theory: Translation, Bisimulation, Interpolation
door Giovanna D'Agostino geboren te Rome.
متن کاملFinal coalgebras as greatest fixed points in ZF set theory
A special final coalgebra theorem, in the style of Aczel (1988), is proved within standard Zermelo-Fraenkel set theory. Aczel’s Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions. Variant ordered pairs and tuples, of possibly infinite length, are special cases of variant functions. Analogues of Aczel’s solution and substitution lemma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90076-6